Search results for "finite [mass]"
showing 10 items of 356 documents
On dependence of sets of functions on the mean value of their elements
2009
The paper considers, for a given closed bounded set M ⊂ R m and K = (0,1) n ⊂ R n , the set M = {h ϵ L2 (K;R m ) | h(x) ϵ M a.e.x ϵ K} and its subsets It is shown that, if a sequence {hk } ⊂ coM converges to an element hk ϵ M(hk ) there is h‘k ϵ M(ho ) such that h'k - hk → 0 as k → ∞ . If, in addition, the set M is finite or M is the convex hull of a finite set of elements, then the multivalued mapping h → M(h) is lower semicontinuous on coM. First published online: 14 Oct 2010
Flame foliation: Evidence for a schistosity formed normal to the extension direction
2007
Abstract Foliations are normally thought to develop approximately parallel to the XY-plane of the finite strain ellipsoid, i.e., perpendicular to the main shortening direction. We present a new type of schistosity named “flame foliation” that forms orthogonal to the main extension direction, approximately parallel to the YZ-plane of finite strain. Flame foliation consists of anastomosing biotite-rich selvedges overprinting S1 in pelitic layers of metaturbitites in NW Namibia. The biotite crystals in the selvedges are peculiar because they are oriented oblique or orthogonal to the flame foliation itself and parallel to the previous S1 cleavage, a feature no other foliation shows. In some cas…
The complexity of finite model reasoning in description logics
2005
AbstractWe analyse the complexity of finite model reasoning in the description logic ALCQI, i.e., ALC augmented with qualifying number restrictions, inverse roles, and general TBoxes. It turns out that all relevant reasoning tasks such as concept satisfiability and ABox consistency are ExpTime-complete, regardless of whether the numbers in number restrictions are coded unarily or binarily. Thus, finite model reasoning with ALCQI is not harder than standard reasoning with ALCQI.
Weak and strong recognition by 2-way randomized automata
1997
Languages weakly recognized by a Monte Carlo 2-way finite automaton with n states are proved to be strongly recognized by a Monte Carlo 2-way finite automaton with no(n) states. This improves dramatically over the previously known result by M.Karpinski and R.Verbeek [10] which is also nontrivial since these languages can be nonregular [5]. For tally languages the increase in the number of states is proved to be only polynomial, and these languages are regular.
Block-Deterministic Regular Languages
2001
We introduce the notions of blocked, block-marked and blockdeterministic regular expressions. We characterize block-deterministic regular expressions with deterministic Glushkov block automata. The results can be viewed as a generalization of the characterization of one-unambiguous regular expressions with deterministic Glushkov automata. In addition, when a language L has a block-deterministic expression E, we can construct a deterministic finite-state automaton for L that has size linear in the size of E.
Generalized finite difference schemes with higher order Whitney forms
2021
Finite difference kind of schemes are popular in approximating wave propagation problems in finite dimensional spaces. While Yee’s original paper on the finite difference method is already from the sixties, mathematically there still remains questions which are not yet satisfactorily covered. In this paper, we address two issues of this kind. Firstly, in the literature Yee’s scheme is constructed separately for each particular type of wave problem. Here, we explicitly generalize the Yee scheme to a class of wave problems that covers at large physics field theories. For this we introduce Yee’s scheme for all problems of a class characterised on a Minkowski manifold by (i) a pair of first ord…
Some results concerning simple locally finite groups of 1-type
2005
AbstractIn this paper several aspects of infinite simple locally finite groups of 1-type are considered. In the first part, the classes of diagonal limits of finite alternating groups, of diagonal limits of finite direct products of alternating groups, and of absolutely simple groups of 1-type are distinguished from each other. In the second part, inductive systems of representations over fields of characteristic zero (which are known to correspond to ideals in the group algebra) are studied in general for groups of 1-type. The roles of primitive respectively imprimitive representations in inductive systems are investigated. Moreover it is shown that in any proper inductive system the depth…
A note on renewal systems
1992
Abstract A renewal system is a symbolic dynamical system generated by free concatenations of a finite set of words. In this paper we prove that, given two systems which are both renewal and Markov systems, it is decidable whether they are topologically conjugate. The proof makes use of the methods and the techniques of formal language theory.
Algorithmic Information Theory and Computational Complexity
2013
We present examples where theorems on complexity of computation are proved using methods in algorithmic information theory. The first example is a non-effective construction of a language for which the size of any deterministic finite automaton exceeds the size of a probabilistic finite automaton with a bounded error exponentially. The second example refers to frequency computation. Frequency computation was introduced by Rose and McNaughton in early sixties and developed by Trakhtenbrot, Kinber, Degtev, Wechsung, Hinrichs and others. A transducer is a finite-state automaton with an input and an output. We consider the possibilities of probabilistic and frequency transducers and prove sever…
Transition Function Complexity of Finite Automata
2011
State complexity of finite automata in some cases gives the same complexity value for automata which intuitively seem to have completely different complexities. In this paper we consider a new measure of descriptional complexity of finite automata -- BC-complexity. Comparison of it with the state complexity is carried out here as well as some interesting minimization properties are discussed. It is shown that minimization of the number of states can lead to a superpolynomial increase of BC-complexity.